4,295 research outputs found
Mapping the Curricular Structure and Contents of Network Science Courses
As network science has matured as an established field of research, there are
already a number of courses on this topic developed and offered at various
higher education institutions, often at postgraduate levels. In those courses,
instructors adopted different approaches with different focus areas and
curricular designs. We collected information about 30 existing network science
courses from various online sources, and analyzed the contents of their syllabi
or course schedules. The topics and their curricular sequences were extracted
from the course syllabi/schedules and represented as a directed weighted graph,
which we call the topic network. Community detection in the topic network
revealed seven topic clusters, which matched reasonably with the concept list
previously generated by students and educators through the Network Literacy
initiative. The minimum spanning tree of the topic network revealed typical
flows of curricular contents, starting with examples of networks, moving onto
random networks and small-world networks, then branching off to various
subtopics from there. These results illustrate the current state of consensus
formation (including variations and disagreements) among the network science
community on what should be taught about networks and how, which may also be
informative for K--12 education and informal education.Comment: 17 pages, 11 figures, 2 tables; to appear in Cramer, C. et al.
(eds.), Network Science in Education -- Tools and Techniques for Transforming
Teaching and Learning (Springer, 2017, in press
Optimizing egalitarian performance in the side-effects model of colocation for data center resource management
In data centers, up to dozens of tasks are colocated on a single physical
machine. Machines are used more efficiently, but tasks' performance
deteriorates, as colocated tasks compete for shared resources. As tasks are
heterogeneous, the resulting performance dependencies are complex. In our
previous work [18] we proposed a new combinatorial optimization model that uses
two parameters of a task - its size and its type - to characterize how a task
influences the performance of other tasks allocated to the same machine.
In this paper, we study the egalitarian optimization goal: maximizing the
worst-off performance. This problem generalizes the classic makespan
minimization on multiple processors (P||Cmax). We prove that
polynomially-solvable variants of multiprocessor scheduling are NP-hard and
hard to approximate when the number of types is not constant. For a constant
number of types, we propose a PTAS, a fast approximation algorithm, and a
series of heuristics. We simulate the algorithms on instances derived from a
trace of one of Google clusters. Algorithms aware of jobs' types lead to better
performance compared with algorithms solving P||Cmax.
The notion of type enables us to model degeneration of performance caused by
using standard combinatorial optimization methods. Types add a layer of
additional complexity. However, our results - approximation algorithms and good
average-case performance - show that types can be handled efficiently.Comment: Author's version of a paper published in Euro-Par 2017 Proceedings,
extends the published paper with addtional results and proof
Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio
We use computational experiments to find the rectangles of minimum area into
which a given number n of non-overlapping congruent circles can be packed. No
assumption is made on the shape of the rectangles. Most of the packings found
have the usual regular square or hexagonal pattern. However, for 1495 values of
n in the tested range n =< 5000, specifically, for n = 49, 61, 79, 97, 107,...
4999, we prove that the optimum cannot possibly be achieved by such regular
arrangements. The evidence suggests that the limiting height-to-width ratio of
rectangles containing an optimal hexagonal packing of circles tends to
2-sqrt(3) as n tends to infinity, if the limit exists.Comment: 21 pages, 13 figure
Scheduling MapReduce Jobs under Multi-Round Precedences
We consider non-preemptive scheduling of MapReduce jobs with multiple tasks
in the practical scenario where each job requires several map-reduce rounds. We
seek to minimize the average weighted completion time and consider scheduling
on identical and unrelated parallel processors. For identical processors, we
present LP-based O(1)-approximation algorithms. For unrelated processors, the
approximation ratio naturally depends on the maximum number of rounds of any
job. Since the number of rounds per job in typical MapReduce algorithms is a
small constant, our scheduling algorithms achieve a small approximation ratio
in practice. For the single-round case, we substantially improve on previously
best known approximation guarantees for both identical and unrelated
processors. Moreover, we conduct an experimental analysis and compare the
performance of our algorithms against a fast heuristic and a lower bound on the
optimal solution, thus demonstrating their promising practical performance
Evaluation of binomial double sums involving absolute values
We show that double sums of the form can always be
expressed in terms of a linear combination of just four functions, namely
, , , and , with
coefficients that are rational in . We provide two different proofs: one is
algorithmic and uses the second author's computer algebra package Sigma; the
second is based on complex contour integrals. In many instances, these results
are extended to double sums of the above form where is
replaced by with independent parameter .Comment: AmS-LaTeX, 42 pages; substantial revision: several additional and
more general results, see Proposition 11 and Theorems 15-1
OStrich: Fair Scheduling for Multiple Submissions
International audienceCampaign Scheduling is characterized by multiple job submissions issued from multiple users over time. This model perfectly suits today's systems since most available parallel environments have multiple users sharing a common infrastructure. When scheduling individually the jobs submitted by various users, one crucial issue is to ensure fairness. This work presents a new fair scheduling algorithm called OStrich whose principle is to maintain a virtual time-sharing schedule in which the same amount of processors is assigned to each user. The completion times in the virtual schedule determine the execution order on the physical processors. Then, the campaigns are interleaved in a fair way by OStrich. For independent sequential jobs, we show that OStrich guarantees the stretch of a campaign to be proportional to campaign's size and the total number of users. The stretch is used for measuring by what factor a workload is slowed down relative to the time it takes on an unloaded system. The theoretical performance of our solution is assessed by simulating OStrich compared to the classical FCFS algorithm, issued from synthetic workload traces generated by two different user profiles. This is done to demonstrate how OStrich benefits both types of users, in contrast to FCFS
Snapping Graph Drawings to the Grid Optimally
In geographic information systems and in the production of digital maps for
small devices with restricted computational resources one often wants to round
coordinates to a rougher grid. This removes unnecessary detail and reduces
space consumption as well as computation time. This process is called snapping
to the grid and has been investigated thoroughly from a computational-geometry
perspective. In this paper we investigate the same problem for given drawings
of planar graphs under the restriction that their combinatorial embedding must
be kept and edges are drawn straight-line. We show that the problem is NP-hard
for several objectives and provide an integer linear programming formulation.
Given a plane graph G and a positive integer w, our ILP can also be used to
draw G straight-line on a grid of width w and minimum height (if possible).Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016
Fixed-Parameter Tractability of Token Jumping on Planar Graphs
Suppose that we are given two independent sets and of a graph
such that , and imagine that a token is placed on each vertex in
. The token jumping problem is to determine whether there exists a
sequence of independent sets which transforms into so that each
independent set in the sequence results from the previous one by moving exactly
one token to another vertex. This problem is known to be PSPACE-complete even
for planar graphs of maximum degree three, and W[1]-hard for general graphs
when parameterized by the number of tokens. In this paper, we present a
fixed-parameter algorithm for the token jumping problem on planar graphs, where
the parameter is only the number of tokens. Furthermore, the algorithm can be
modified so that it finds a shortest sequence for a yes-instance. The same
scheme of the algorithms can be applied to a wider class of graphs,
-free graphs for any fixed integer , and it yields
fixed-parameter algorithms
A new species of Dermopristis Kearn, Whittington & Evans-Gowing, 2010 (Monogenea: Microbothriidae), with observations on associations between the gut diverticula and reproductive system and on the presence of denticles in the nasal fossae of the host Glaucostegus typus (Bennett) (Elasmobranchii: Rhinobatidae)
Dermopristis cairae n. sp. (Microbothriidae) is described from the skin and possibly from the nasal fossae of the giant shovelnosed ray Glaucostegus typus (Bennett). The new species is distinguished from D. paradoxus Kearn, Whittington & Evans-Gowing, 2010 by its larger size, body shape, lack of transverse ridges on the ventral surface and absence of a seminal receptacle. Extensive short gut branches lie dorsal to the testes and adjacent to the coiled region of the vas deferens and the oo¨type, possibly reflecting high metabolic demand in these areas. Denticles are present in the lining of the nasal fossae of G. typus, providing a firm substrate for the cement-based attachment of a microbothriid. However, confirmation that D. cairae inhabits the nasal fossae of G. typus is required
Moment-based parameter estimation in binomial random intersection graph models
Binomial random intersection graphs can be used as parsimonious statistical
models of large and sparse networks, with one parameter for the average degree
and another for transitivity, the tendency of neighbours of a node to be
connected. This paper discusses the estimation of these parameters from a
single observed instance of the graph, using moment estimators based on
observed degrees and frequencies of 2-stars and triangles. The observed data
set is assumed to be a subgraph induced by a set of nodes sampled from
the full set of nodes. We prove the consistency of the proposed estimators
by showing that the relative estimation error is small with high probability
for . As a byproduct, our analysis confirms that the
empirical transitivity coefficient of the graph is with high probability close
to the theoretical clustering coefficient of the model.Comment: 15 pages, 6 figure
- …